A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem
نویسندگان
چکیده
منابع مشابه
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging...
متن کاملA Hybrid Improvement Heuristic for the Bin Packing Problem
Given a set of n items with weights wi, i = 1, . . . , n, the bin packing (BP) problem consists of finding the minimum number of bins of capacity C necessary to pack the items, without violating the capacity constraint. This formulation also entails another problem (DBP), in which we seek to minimize the capacity of a fixed number m of identical bins, so that all items fit in the m bins without...
متن کاملA hybrid improvement heuristic for the bin-packing problem and its application to the multiprocessor scheduling problem
This work presents a hybrid improvement procedure for the bin packing problem and its application to the multiprocessor scheduling problem. This heuristic has several features: a new lower bound; reductions; initial solutions by reference to the dual problem; heuristics for load redistribution, and an improvement process utilizing tabu search. It improved the best known solutions for many of th...
متن کاملA one-dimensional bin packing problem with shelf divisions
Given bins of size B, non-negative values d and ∆, and a list L of items, each item e ∈ L with size se and class ce, we define a shelf as a subset of items packed inside a bin with total items size at most ∆ such that all items in this shelf have the same class. Two subsequent shelves must be separated by a shelf division of size d. The size of a shelf is the total size of its items plus the si...
متن کاملA hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
The three-dimensional bin packing problem is a practical problem faced in modern industrial processes such as container ship loading, pallet loading, plane cargo management, and warehouse management. This article considers a three-dimensional bin packing problem in which objects of various volumes are packed into a single bin to maximize the number of objects packed. The bin packing problem ini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2004
ISSN: 1381-1231
DOI: 10.1023/b:heur.0000026267.44673.ed